Game Theory : Lecture 2
نویسنده
چکیده
منابع مشابه
COMS E 6998 : Algorithmic Game Theory and Economics Jan 27 , 2011 Lecture 2 – Congestion Games
Last week we looked at a global network connection game, and used the potential function method to show the existence of a global potential function and a pure equilibrium for that game. This week we will broaden our focus to the generalization of this game, which is the category of the Congestion Games. These games are of interest because they model many network, routing and resource allocatio...
متن کامل5 . Applications to streaming
In this lecture, we will see applications of communication complexity to proving lower bounds for streaming algorithms. Towards the end of the lecture, we will introduce combinatorial auctions, and we will see applications of communication complexity to auctions in the next lecture. The references for this lecture include Lecture 7 of Troy Lee’s course on communication complexity [Lee10], Lectu...
متن کاملCS 364 A : Algorithmic Game Theory Lecture # 17 : No - Regret Dynamics ∗
This lecture continues to study the questions introduced last time. Do strategic players reach an equilibrium of a game? How quickly? By what learning processes? Positive results on these questions justify equilibrium analysis, including bounds on the price of anarchy. Last lecture focused on best-response dynamics. These dynamics are most relevant for potential games, which cover many but not ...
متن کاملTeaching children cooperation — An application of experimental game theory
This paper studies children’s behavior in a prisoner’s dilemma game. I attempted to teach children cooperation by means of a short moral lecture. Over the period of 12 months, I experimented with 196 children between the ages of six and eleven. The experimental findings are as follows. (1) In support of the developmental psychology theories, the proportions of cooperation are indeed higher for ...
متن کاملCS364A: Algorithmic Game Theory Lecture #20: Mixed Nash Equilibria and PPAD-Completeness∗
Today we continue our study of the limitations of learning dynamics and polynomial-time algorithms for converging to and computing equilibria. Recall that we have sweeping positive results for coarse correlated and correlated equilibria, which are tractable in arbitrary games. We have only partial positive results for pure Nash equilibria of routing and congestion games, and last lecture we dev...
متن کامل